Energy-efficient scheduling: classification, bounds, and algorithms

The problem of attaining energy efficiency in distributed systems is importance, but a general, non-domain-specific theory energy-minimal scheduling far from developed. In this paper, we classify the problems and present theoretical foundations same. We derive results concerning independent jobs system with functionally similar machines different working idle power ratings. considered our can have identical as well speeds. If be divided into arbitrary parts, show that minimum-energy schedule generated linear time give exact algorithms. For cases where are non-divisible, prove NP-hard also approximation algorithms for same along their bounds.